Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
نویسندگان
چکیده
Infinite-dimensional compressed sensing deals with the recovery of analog signals (functions) from linear measurements, often in form integral transforms such as Fourier transform. This framework is well-suited to many real-world inverse problems, which are typically modelled infinite-dimensional spaces, and where application finite-dimensional approaches can lead noticeable artefacts. Another typical feature problems that not only sparse some dictionary, but possess a so-called local sparsity levels structure. Consequently, sampling scheme should be designed so exploit this additional In paper, we introduce series uniform guarantees for based on multilevel random subsampling. By using weighted $\ell^1$-regularizer derive measurement conditions sharp up log factors, sense they agree those certain oracle estimators. These also apply finite dimensions, improve existing results unweighted $\ell^1$-regularization. To illustrate our results, consider problem binary Walsh transform orthogonal wavelets. Binary an important mechanism imaging modalities. Through carefully estimating coherence between wavelet bases, first known problem.
منابع مشابه
Generalized Sampling and Infinite-Dimensional Compressed Sensing
We introduce and analyze an abstract framework, and corresponding method, for compressed sensing in infinite dimensions. This extends the existing theory from signals in finite-dimensional vectors spaces to the case of separable Hilbert spaces. We explain why such a new theory is necessary, and demonstrate that existing finite-dimensional techniques are ill-suited for solving a number of import...
متن کاملInfinite-dimensional compressed sensing and function interpolation
We introduce and analyze a framework for function interpolation using compressed sensing. This framework – which is based on weighted l minimization – does not require a priori bounds on the expansion tail in either its implementation or its theoretical guarantees. Moreover, in the absence of noise it leads to genuinely interpolatory approximations. We also establish a series of new recovery gu...
متن کاملInfinite dimensional compressed sensing from anisotropic measurements
In this paper, we consider a compressed sensing problem in which both the measurement and the sparsifying systems are assumed to be frames (not necessarily tight) of the underlying Hilbert space of signals, which may be finite or infinite dimensional. The main result gives explicit bounds on the number of measurements in order to achieve stable recovery, which depends on the mutual coherence of...
متن کاملFast binary embeddings, and quantized compressed sensing with structured matrices
This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset X ⊂ Rn, associated with the Euclidean metric, with points in the cube {±1}m and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in X . Our methods rely on qua...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2021
ISSN: ['1096-603X', '1063-5203']
DOI: https://doi.org/10.1016/j.acha.2021.04.001